Stable models are generated by a stable chain
نویسندگان
چکیده
منابع مشابه
Stable Models Are Generated by a Stable Chain
We propose a general preference criterion selecting thèintended' models of generalized logic programs which a) is a conservative extension of the stable model semantics for normal logic programs of GL88], b) is very close to the answer set semantics of GL91] for disjunctive logic programs, and c) allows for arbitrary formulas in the body and in the head of a rule, i.e. does not depend on the pr...
متن کاملStable Models Are Generated by a Stabel Chain
We propose a general preference criterion selecting thèintended' models of generalized logic programs which a) is a conservative extension of the stable model semantics for normal logic programs of GL88], b) is very close to the answer set semantics of GL91] for disjunctive logic programs, and c) allows for arbitrary formulas in the body and in the head of a rule, i.e. does not depend on the pr...
متن کاملStable Rings Generated by Their Units
We introduce the class of rings satisfying (m,1)-stable range and investigate equivalent characterizations of such rings. These give generalizations of the corresponding results by Badawi (1994), Ehrlich (1976), and Fisher and Snider (1976). 2000 Mathematics Subject Classification. 19B10, 16E50. Let R be an associative ring with identity. A ring R is said to have stable range one provided that ...
متن کاملTemporal Stable Models are LTL-representable
Many scenarios in Answer Set Programming (ASP) deal with dynamic systems over (potentially infinite) linear time. Temporal Equilibrium Logic (TEL) is a formalism that allows defining the idea of temporal stable model not only for dynamic domains in ASP, but aso for any arbitrary theory in the syntax of Linear-Time Temporal Logic (LTL). In the past, several tools for computing temporal stable mo...
متن کاملPartial Stable Generated Models of Generalized Logic Programs with Constraints
Logic programs are an important knowledge representation tool. In many cases, definite logic programs are too restricted to formalize problems intuitively. Therefore definite logic programs have been extended in several ways by additional syntactic constructs such as negation and disjunction. A very expressive program class are generalized logic programs. Their rules may contain any quantifier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1997
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(96)00106-9